Tree-Chromatic Number Is Not Equal to Path-Chromatic Number*
نویسندگان
چکیده
منابع مشابه
Tree-chromatic number
Let us say a graph G has “tree-chromatic number” at most k if it admits a tree-decomposition (T, (Xt : t ∈ V (T ))) such that G[Xt] has chromatic number at most k for each t ∈ V (T ). This seems to be a new concept, and this paper is a collection of observations on the topic. In particular we show that there are graphs with tree-chromatic number two and with arbitrarily large chromatic number; ...
متن کاملRamsey Theory for Binary Trees and the Separation of Tree-chromatic Number from Path-chromatic Number
We propose a Ramsey theory for binary trees and prove that for every r-coloring of “strong copies” of a small binary tree in a huge complete binary tree T , we can find a strong copy of a large complete binary tree in T with all small copies monochromatic. As an application, we construct a family of graphs which have treechromatic number at most 2 while the path-chromatic number is unbounded. T...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملPacking chromatic number versus chromatic and clique number
The packing chromatic number χρ(G) of a graphG is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ∈ [k], where each Vi is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that ω(G) = a, χ(G) = b, and χρ(G) = c. If so, we say that (a, b, c) is realizable. It is proved that b =...
متن کاملThe Adaptable Chromatic Number and the Chromatic Number
We prove that the adaptable chromatic number of a graph is at least asymptotic to the square root of the chromatic number. This is best possible. Consider a graph G where each edge of G is assigned a colour from {1, ..., k} (this is not necessarily a proper edge colouring). A k-adapted colouring is an assignment of colours from {1, ..., k} to the vertices of G such that there is no edge with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2017
ISSN: 0364-9024
DOI: 10.1002/jgt.22121